The Complexity of Computational Problems in Exact Linear Algebra
نویسندگان
چکیده
The Complexity of Computational Problems in Exact Linear Algebra Name: Erich L. Kaltofen, Arne Storjohann Affil./Addr. 1: North Carolina State University Department of Mathematics Raleigh, NC 27695-8205, USA Phone: (919) 515-8785 E-mail: [email protected] Affil./Addr. 2: University of Waterloo David R. Cheriton School of Computer Science Waterloo, Ontario, Canada N2L 3G1 Phone: (519) 888-4567x36361 E-mail: [email protected]
منابع مشابه
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity
We investigate the computational complexity of some important problems in linear algebra. 1. The problem of verifying the characteristic polynomial of a matrix is known to be in the complexity class C=L (Exact Counting in Logspace). We show that it is complete for C=L under logspace many-one reductions. 2. The problem of deciding whether two matrices are similar is known to be in the complexity...
متن کاملTutorial: Exact Numerical Computation in Algebra and Geometry
Many problems in Computational Science & Engineering (CS&E) are defined on the continuum. Standard algorithms for these problems are numerical and approximate. Their computational techniques include iteration, subdivision, and approximation. Such techniques are rarely seen in exact or algebraic algorithms. In this tutorial, we discuss a mode of computation called exact numerical computation (EN...
متن کاملDense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages
In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide efficient implementations of such algorithms one need to be careful with the underlying arithmetic. It is well known that modular techniques such as the Chine...
متن کاملInterval Linear Algebra and Computational Complexity
This work connects two mathematical fields – computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra – regularity and singularity, full column rank, solving a linear system, deciding solvability of a linear system, computing inverse matrix, eigenvalues, checking positive (semi)definiteness or stability. We discuss these problems and relati...
متن کاملKrylov Subspace Recycling for Fast Iterative Least-Squares in Machine Learning
Solving symmetric positive definite linear problems is a fundamental computational task in machine learning. The exact solution, famously, is cubicly expensive in the size of the matrix. To alleviate this problem, several linear-time approximations, such as spectral and inducing-point methods, have been suggested and are now in wide use. These are low-rank approximations that choose the low-ran...
متن کامل